VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
نویسندگان
چکیده
منابع مشابه
Verifying BPEL-like Programs with Hoare Logic: Technical Report
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechanism. To understand it better, many recent works have mainly focused on formal semantic models for WS-BPEL. In this paper, we make one step forward by investigating the verification problem for business processes writte...
متن کاملVerifying BPEL-like Programs with Hoare Logic (Longer Version)
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechanism. To understand it better, many recent works have mainly focused on formal semantic models for WS-BPEL. In this paper, we make one step forward by investigating the verification problem for business processes writte...
متن کاملClosing the Gap - Formally Verifying Dynamically Typed Programs like Statically Typed Ones Using Hoare Logic - Extended Version -
Dynamically typed object-oriented languages enable programmers to write elegant, reusable and extensible programs. However, with the current methodology for program verification, the absence of static type information creates significant overhead. Our proposal is two-fold: First, we propose a layer of abstraction hiding the complexity of dynamic typing when provided with sufficient type informa...
متن کاملHoare Logic for Parallel Programs
In the following theories a formalization of the Owicki-Gries and the relyguarantee methods is presented. These methods are widely used for correctness proofs of parallel imperative programs with shared variables. We define syntax, semantics and proof rules in Isabelle/HOL. The proof rules also provide for programs parameterized in the number of parallel components. Their correctness w.r.t. the...
متن کاملHoare logic for multistaged programs
In this work we present a straight forward extension of Hoare logic that caters for multistaged programs. We have chosen a minimalist support language which allowed us to focus on the issues pertaining to the staged features. Similarly, the support logic is a simple, staged, first order logic with equality assertions. We allow the equality assertions to contain descriptions of staged code in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2002
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s012905410200114x